Complete graph - PDFSEARCH.IO - Document Search Engine

Complete graph
Results: 868

#	Item
391	Algorithms for Placing Monitors in a Flow Network (Preliminary Version) Francis Chin1, , Marek Chrobak2, , and Li Yan2, 1 Add to Reading List Source URL: i.cs.hku.hk Language: English - Date: 2013-09-02 22:22:25 NP-complete problems Graph connectivity Graph Multigraph Bridge Minimum k-cut Line graph Graph coloring Graph theory Mathematics Theoretical computer science
392	A Refined Complexity Analysis of Degree Anonymization on Graphs Sepp Hartung1 , Andr´e Nichterlein1 , Rolf Niedermeier1 , and Ondˇrej Such´ y2 1 Institut f¨ Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2013-05-03 04:36:19 NP-complete problems Analysis of algorithms Parameterized complexity Kernelization Degeneracy Graph Degree Vertex Neighbourhood Graph theory Theoretical computer science Mathematics
393	A Constant-Factor Approximation for Stochastic Steiner Forest ∗ Anupam Gupta Amit Kumar Add to Reading List Source URL: www.cse.iitd.ernet.in Language: English - Date: 2009-03-25 10:41:58 NP-complete problems Network theory Vertex cover Steiner tree problem Shortest path problem Linear programming SL Edge disjoint shortest pair algorithm Pseudoforest Theoretical computer science Graph theory Mathematics
394	Image and Vision Computing–922 Contents lists available at ScienceDirect Image and Vision Computing journal homepage: www.elsevier.com/locate/imavis Add to Reading List Source URL: www.dsi.unive.it Language: English - Date: 2010-08-27 12:14:18 Clique Cograph K-tree Matching Maximal independent set Clique-sum Graph theory Graph operations NP-complete problems
395	Efficient Algorithms for Eulerian Extension and Rural Postman∗ Frederic Dorn† Hannes Moser‡¶ Mathias Weller§k Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2013-01-23 08:47:12 Route inspection problem Multigraph Graph Line graph Degree Directed graph Clique Shortest path problem BEST theorem Graph theory NP-complete problems Eulerian path
396	Noname manuscript No. (will be inserted by the editor) On Tractable Cases of Target Set Selection Andr´ Add to Reading List Source URL: www.akt.tu-berlin.de Language: English - Date: 2012-06-07 13:36:43 NP-complete problems Vertex cover Kernelization Feedback vertex set Clique Dominating set Tree decomposition Graph Vertex Graph theory Theoretical computer science Mathematics
397	A Refined Complexity Analysis of Degree Anonymization in GraphsI Sepp Hartunga , Andr´e Nichterleina , Rolf Niedermeiera , Ondˇrej Such´ yb a Institut Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2014-09-29 07:15:40 NP-complete problems Kernelization Graph coloring Clique Independent set Degree Neighbourhood Degeneracy Parameterized complexity Graph theory Theoretical computer science Mathematics
398	On the complexity of searching for an evader with a faster pursuer Florian Shkurti1 and Gregory Dudek1 Abstract— In this paper we examine pursuit-evasion games in which the pursuer has higher speed than the evader. Thi Add to Reading List Source URL: www.cim.mcgill.ca Language: English - Date: 2013-05-18 17:31:04 Search algorithms Pursuit-evasion game theory Shortest path problem NP-complete Planar graph Breadth-first search Binary tree Depth-first search Graph theory Theoretical computer science Mathematics
399	Effective and Efficient Data Reduction for the Subset Interconnection Design Problem? Jiehua Chen1 , Christian Komusiewicz1 , Rolf Niedermeier1 , Manuel Sorge1 , Ondˇrej Such´ y2 , and Mathias Weller3 1 Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2013-10-09 05:34:13 Hypergraph Graph Vertex cover Constraint programming Kernelization Graph theory Theoretical computer science NP-complete problems
400	Spanners and Sparsifiers in Dynamic Streams Michael Kapralov∗ MIT ABSTRACT Linear sketching is a popular technique for computing in dynamic Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2014-12-09 10:13:51 Combinatorial optimization Spanning tree NP-complete problems Algebraic graph theory Probabilistic complexity theory Randomized algorithm Connectivity Minimum spanning tree Graph partition Mathematics Theoretical computer science Graph theory

UPDATE